The problem forming matrix into graph in network topology is researched. This paper presents a algorithm of realizing linear tree in terms of researching the property of the number of one link ciruit through every tree branch in fundamental circuit matrix B f. 在网络拓扑学中要研究由矩阵实现为图的问题,通过对基本回路矩阵Bf中各树支关联的单连支回路数性质的研究,提出了实现线形树的一种算法。
The Method of Realizing the Linear Tree Corresponding to the Fundamental Circuit Matrix 实现基本回路矩阵所对应的线形树的方法